Online Scheduling Aiming to Satisfy Due Date for Flexible Flow Shops
نویسندگان
چکیده
منابع مشابه
Group Scheduling Problems in Flexible Flow Shops
Flexible flow shops are becoming increasingly common in industry practice because of higher workloads imposed by jobs on one or more stages, thus requiring two or more units of the same machine type. We present a methodology for solving this important problem, namely group scheduling, within the context of cellular manufacturing systems in order to minimize the total completion time of all grou...
متن کاملScheduling a Flexible Flow Shops Problem using DEA
This paper considers a scheduling problem in flexible flow shops environment with the aim of minimizing two important criteria including makespan and cumulative tardiness of jobs. Since the proposed problem is known as an Np-hard problem in literature, we have to develop a meta-heuristic to solve it. We considered general structure of Genetic Algorithm (GA) and developed a new version of that b...
متن کاملReal-Time Routing in Flexible Flow Shops:
In this talk a self-adaptive, swarm-based control model for real-time part routing in a flexible flow shop environment is presented.. The proposed control model is a multi-agent system that exhibits adaptive behaviour, which has been inspired from the natural system of the wasp colony. The production problem, which was first introduced by Morley et al. (Morley and Schelberg 1993, Morley 1996, M...
متن کاملEconomic Lot Sizing and Scheduling in Distributed Permutation Flow Shops
This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be d...
متن کاملScheduling Flow - Shops with Limited Buffer Spaces
The work described in this paper attempts to validate the implicit assumption in traditional flow shop scheduling research that there is a buffer of infinite capacity between any two adjacent machines. The modified NEH (Nawaz, Encore and Ham) algorithm is used to generate an initial permutation schedule which is then improved by tabu search. For any given sequence, a limited equal buffer size i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSME International Journal Series C
سال: 2005
ISSN: 1344-7653,1347-538X
DOI: 10.1299/jsmec.48.21